Design und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Local Search in Memetic Algorithms: the Impact of the Local Search Frequency
نویسنده
چکیده
Memetic algorithms are popular randomized search heuristics combining evolutionary algorithms and local search. Their efficiency has been demonstrated in countless applications covering a wide area of practical problems. However, theory of memetic algorithms is still in its infancy and there is a strong need for a rigorous theoretical foundation to better understand these heuristics. Here, we attack one of the fundamental issues in the design of memetic algorithms from a theoretical perspective, namely the choice of the frequency with which local search is applied. Since no guidelines are known for the choice of this parameter, we care about its impact on memetic algorithm performance. We present worst-case problems where the choice of the local search frequency has an enormous impact on the performance of a simple memetic algorithm. A rigorous theoretical analysis shows that on these problems, with overwhelming probability, even a small factor of 2 decides about polynomial versus exponential optimization times.
منابع مشابه
Design und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence On the Analysis of the (1+1) Memetic Algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory on memetic algorithms is still in its infancy. Here, we introduce a simple memetic algorithm, the (1+1) Memetic Algorithm ((1+1) MA), working with a population size of 1 and no crossover. We compare it with the well-k...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Pareto Set and EMOA Bahavior for Simple Multimodal Multiobjective Functions
Recent research on evolutionary multiobjective optimization has mainly focused on Pareto-fronts. However, we state that proper behavior of the utilized algorithms in decision/search space is necessary for obtaining good results if multimodal objective functions are concerned. Therefore, it makes sense to observe the development of Pareto-sets as well. We do so on a simple, configurable problem,...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Pareto Set and EMOA Behavior for Simple Multimodal Multiobjective Functions
Recent research on evolutionary multiobjective optimization has mainly focused on Pareto-fronts. However, we state that proper behavior of the utilized algorithms in decision/search space is necessary for obtaining good results if multimodal objective functions are concerned. Therefore, it makes sense to observe the development of Pareto-sets as well. We do so on a simple, configurable problem,...
متن کاملSonderforschungsbereich 531: Design und Management komplexer Prozesse und Systeme mit Methoden der Computational Intelligence
متن کامل
Design und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs*
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple randomized optimizers on the maximum clique problem on planar graphs is investigated rigorously. The focus is on the worst-, average-, and semi-average-case behaviors. In semi-random planar graph models an adversary i...
متن کامل